- Title
- The maximum degree and diameter-bounded subgraph in the mesh
- Creator
- Miller, Mirka; Pérez-Rosés, Hebert; Ryan, Joe
- Relation
- Discrete Applied Mathematics Vol. 160, Issue 12, p. 1782-1790
- Publisher Link
- http://dx.doi.org/10.1016/j.dam.2012.03.035
- Publisher
- Elsevier
- Resource Type
- journal article
- Date
- 2012
- Description
- The problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree Δ and the diameter D, was introduced in Dekker et al. (2012) [1], as a generalization of the Degree–Diameter Problem. A case of special interest is when the host graph is a common parallel architecture. Here we discuss the case when the host graph is a k-dimensional mesh. We provide some general bounds for the order of the largest subgraph in arbitrary dimension k, and for the particular cases of k=3, Δ=4 and k=2,Δ=3, we give constructions that result in sharper lower bounds.
- Subject
- network design; degree-diameter problem; parallel architectures; mesh; Delannoy numbers
- Identifier
- http://hdl.handle.net/1959.13/1309046
- Identifier
- uon:21755
- Identifier
- ISSN:0166-218X
- Language
- eng
- Reviewed
- Hits: 989
- Visitors: 1093
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|